A recipe for finding good solutions to MINLPs

A Good Recipe for Solving MINLPs

Finding good (or even just feasible) solutions for MixedInteger Nonlinear Programming problems independently of the specific problem structure is a very hard but practically useful task, specially when the objective/constraints are nonconvex. We present a generalpurpose heuristic based on Variable Neighbourhood Search, Local Branching, Sequential Quadratic Programming and Branch-and-Bound. We t...

Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning

In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Based on our observation that MINLPs in many engineering applications have highly structured constraints, we propose to partition these MINLPs by their constraints into subproblems, solve each subproblem by an existing solver, and...

Orange and Sunlight: A Recipe for Blisters

LaGO - An Object Oriented Library for Solving MINLPs

The paper describes a software package called LaGO for solving nonconvex mixed integer nonlinear programs (MINLPs). The main component of LaGO is a convex relaxation which is used for generating solution candidates and computing lower bounds of the optimal value. The relaxation is generated by reformulating the given MINLP as a block-separable problem, and replacing nonconvex functions by conve...

A Branch and Bound Method for Finding Flow Path Designing of Agv Systems (RESEARCH NOTE)

One of the important factor in the design of automated guided vehicle systems (AGVS) is the flow path design. This paper presents a branch-and-bound algorithm to determining the flow path by considering not only loaded-vehicles, but also empty-vehicles. The objective is to find the flow path, which will minimize total travel of loaded vehicles. We know that in branch-and-bound method a branch c...